Rotation Distance, Triangulations, and Hyperbolic Geometry
نویسندگان
چکیده
منابع مشابه
Rotation Distance , Triangulations , and Hyperbolic Geometry Daniel
A rotation in a binary tree is a local restructuring that changes thetree into another tree. Rotations are useful in the design of tree-based data struc-tures. The rotation distance between a pair of trees is the minimum number ofrotations needed to convert one tree into the other. In this paper we estab-lish a tight bound of 2n 6 on the maximum rotation distance between two...
متن کاملRotation Distance, Triangulations of Planar Surfaces and Hyperbolic Geometry
In a beautiful paper, Sleator, Tarjan and Thurston solved the problem of maximum rotation distance of two binary trees. Equivalently they solved the problem of rotation distance of triangulations on the disk. We extend their results to rotation distance of triangulations of other planar surfaces. We give upper and lower bounds for this problem. Equivalently, by duality, one can interpret our re...
متن کاملDegenerations of ideal hyperbolic triangulations
Let M be the interior of a compact, orientable 3–manifold with non-empty boundary a disjoint union of tori, and T be an ideal triangulation of M . The affine algebraic set D(M ; T ), a subset of which parameterises (incomplete) hyperbolic structures obtained on M using T , is defined and compactified by adding projective classes of transversely measured singular codimension–one foliations of (M...
متن کاملFat Triangulations and Differential Geometry
We study the differential geometric consequences of our previous result on the existence of fat triangulations, in conjunction with a result of Cheeger, Müller and Schrader, regarding the convergence of Lipschitz-Killing curvatures of piecewise-flat approximations of smooth Riemannian manifolds. A further application to the existence of quasiconformal mappings between manifolds, as well as an e...
متن کاملMinimum Average Distance Triangulations
Some of the following problems look similar to the MAD Triangulation problem, but we have not found any deep connections: •Minimum Average Distance Spanning Subgraph in a budgeted version [2] was studied in the context of network design (minimizing average routing time). The problem is NP-complete even with unit weights. •Minimum Average Distance Spanning Tree [1]. NP-completeness is implied by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the American Mathematical Society
سال: 1988
ISSN: 0894-0347
DOI: 10.2307/1990951